Enhance wireless Capacity through Multi-hop Scheduling

Today’s, throughput capacity of a wireless network is big challenge and also, single-hop scheduling communication requests was not consider routing nor power control problems. In a single hop it targets only an approximation that is optimal up to a factor that is logarithmic in the number of requests. In this type scheduling algorithm The NP-hard problems are occurred when it compute any network’s capacity up to a small insecurity. In existing paper, used Signal to Interference plus Noise Ratio (SINR) and greedy algorithm which are not able to deal with difficult scenario as efficiently one of the biggest drawback of greedy, its compute three time longer than approx A. In existing paper[1], by applying the single-slot subroutine repeatedly to realize an O(log n)-approximation (where is the number of communication links) for the problem of minimizing the number of time slots needed to schedule a given set of arbitrary requests. All these problems are overcome in our proposed system. In this paper, we proposed Muti-hop scheduling algorithm to overcome single-hop scheduling problems. We also proposed instance-based measure of interference which is overcome to problem of past result of SINR. Also we proved lower and upper bounds for scheduling to a set of request. We are improving on previous approximation factor to introducing approx A in term of lower and upper bounds.